Fast Computation of Voigt Functions via Fourier Transforms
نویسنده
چکیده
This work presents a method of computing Voigt functions and their derivatives, to high accuracy, on a uniform grid. It is based on an adaptation of Fourier-transform based convolution. The relative error of the result decreases as the fourth power of the computational effort. Because of its use of highly vectorizable operations for its core, it can be implemented very efficiently in scripting language environments which provide fast vector libraries. The availability of the derivatives makes it suitable as a function generator for non-linear fitting procedures.
منابع مشابه
Efficient Computation of Fourier Transforms on Compact Groups
This paper generalizes the fast Fourier transform algorithm to the computationof Fourier transformson compact Lie groups. The basic technique uses factorization of group elements and Gel'fand-Tsetlin bases to simplify the computations, and may be extended to treat the computation of Fourier transforms of nitely supported distributions on the group. Similar transforms may be deened on homogeneou...
متن کاملAccuracy of the Discrete Fourier Transform and the Fast Fourier Transform
Fast Fourier transform (FFT)-based computations can be far more accurate than the slow transforms suggest. Discrete Fourier transforms computed through the FFT are far more accurate than slow transforms, and convolutions computed via FFT are far more accurate than the direct results. However, these results depend critically on the accuracy of the FFT software employed, which should generally be...
متن کاملGrids and transforms for band-limited functions in a disk
We develop fast discrete Fourier transforms (and their adjoints) from a square in space to a disk in the Fourier domain. Since our new transforms are not unitary, we develop a fast inversion algorithm and derive corresponding estimates that allow us to avoid iterative methods typically used for inversion. We consider the eigenfunctions of the corresponding band-limiting and space-limiting opera...
متن کاملFast Fourier Analysis for Abelian Group Extensions
Let G be a nite group and f any complex-valued function deened on G and an irreducible complex matrix representation of G. The Fourier transform of f at is deened to be the matrix P s2G f(s)(s). The Fourier transforms of f at all the irreducible representations of G determine f via the Fourier inversion formula f(s) = 1 j Gj P d trace(b f()(s ?1)): Direct computation of all Fourier transforms o...
متن کاملPathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)
This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds. The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006